A heuristic approach for the online order batching problem with multiple pickers

The Online Order Batching Problem with Multiple Pickers (OOBPMP) consists of optimizing the operations related to picking process orders in a warehouse, when policy follows an order batching strategy. In this case, variant well-known considers existence multiple workers warehouse and online arrival orders. We study three different objective functions for problem: minimizing completion time, differences workload among pickers. have identified classified all previous works literature OOBPMP. Finally, we propose multistart procedure hybridized Variable Neighborhood Descent metaheuristic handle problem. test our proposal over instances previously reported by empirically comparing performance methods state art. statistical tests corroborated significance results obtained.